On Eulerianity and Hamiltonicity in Annihilating-ideal Graphs

نویسندگان

  • A. Kourehpaz Department of Mathematics, Jundi-Shapur University of Technology
  • R. Nikandish Department of Mathematics, Jundi-Shapur University of Technology
چکیده مقاله:

Let $R$ be a commutative ring with identity, and $ mathrm{A}(R) $ be the set of ideals with non-zero annihilator. The annihilating-ideal graph of $ R $ is defined as the graph $AG(R)$ with the vertex set $ mathrm{A}(R)^{*}=mathrm{A}(R)setminuslbrace 0rbrace $ and two distinct vertices $ I $ and $ J $ are adjacent if and only if $ IJ=0 $. In this paper, conditions under which $AG(R)$ is either Eulerian or Hamiltonian are given.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Domination Number in the Annihilating-ideal Graphs of Commutative Rings

Let R be a commutative ring with identity and A(R) be the set of ideals with nonzero annihilator. The annihilating-ideal graph of R is defined as the graph AG(R) with the vertex set A(R) = A(R)r {0} and two distinct vertices I and J are adjacent if and only if IJ = 0. In this paper, we study the domination number of AG(R) and some connections between the domination numbers of annihilating-ideal...

متن کامل

On testing Hamiltonicity of graphs

Let us fix a function f(n) = o(n lnn) and reals 0 ≤ α < β ≤ 1. We present a polynomial time algorithm which, given a directed graph G with n vertices, decides either that one can add at most βn new edges to G so that G acquires a Hamiltonian circuit or that one cannot add αn or fewer new edges to G so that G acquires at least e−f(n)n! Hamiltonian circuits, or both.

متن کامل

Hamiltonicity in multitriangular graphs

The family of 5–valent polyhedral graphs whose faces are all triangles or 3s–gons, s ≥ 9, is shown to contain non–hamiltonian graphs and to have a shortness exponent smaller than one.

متن کامل

Hamiltonicity in connected regular graphs

In 1980, Jackson proved that every 2-connected k-regular graph with at most 3k vertices is Hamiltonian. This result has been extended in several papers. In this note, we determine the minimum number of vertices in a connected k-regular graph that is not Hamiltonian, and we also solve the analogous problem for Hamiltonian paths. Further, we characterize the smallest connected k-regular graphs wi...

متن کامل

On Hamiltonicity of {claw, net}-free graphs

An st-path is a path with the end-vertices s and t. An s-path is a path with an end-vertex s. The results of this paper include necessary and sufficient conditions for a {claw, net}-free graph G with s, t ∈ V (G) and e ∈ E(G) to have (1) a Hamiltonian s-path, (2) a Hamiltonian st-path, (3) a Hamiltonian sand st-paths containing e when G has connectivity one, and (4) a Hamiltonian cycle containi...

متن کامل

Exact annihilating-ideal graph of commutative rings

The rings considered in this article are commutative rings with identity $1neq 0$. The aim of this article is to define and study the exact annihilating-ideal graph of commutative rings. We discuss the interplay between the ring-theoretic properties of a ring and graph-theoretic properties of exact annihilating-ideal graph of the ring.

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 16  شماره 1

صفحات  97- 104

تاریخ انتشار 2021-04

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

کلمات کلیدی

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023